Subdifferential test for optimality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Optimality Conditions via Weak Subdifferential and Augmented Normal Cone

In this paper, we investigate relation between weak subdifferential and augmented normal cone. We define augmented normal cone via weak subdifferential and vice versa. The necessary conditions for the global maximum are also stated. We produce preliminary properties of augmented normal cones and discuss them via the distance function. Then we obtain the augmented normal cone for the indicator f...

متن کامل

Multiple Optimality Properties of the Shewhart Test

For the problem of sequential detection of changes, we adopt the probability maximizing approach in place of the classical minimization of the average detection delay and propose modified versions of the Shiryaev, Lorden, and Pollak performance measures. For these alternative formulations, we demonstrate that the optimum sequential detection scheme is the simple Shewhart rule. Interestingly, we...

متن کامل

An Efficient Optimality Test for the Fuzzy c-Means Algorithm

The Fuzzy c-means algorithm (FCM) is proved to converge to either local minimum or saddle point by Bezdek et al.. However, it is problematical to judge the local minimum of a solution of the FCM in an easy way. In this paper, the Hessian matrix of one reduced objective function of the FCM is got and analyzed. Based on this study, a new optimality test of fixed points of the FCM is given, and it...

متن کامل

Optimization and optimality test for the Max-Cut Problem

We show that the following two problems are polynomiaUy equivalent: 1) Given a (weighted) graph G, and a cut C of G, decide whether C is maximal or not . 2) Given a (weighted) graph G, and a cut C of G, decide whether C is maximal or not , and in case it is not , find a better solution C'. As a consequence, an optimali ty testing oracle may be used to design a polynomial t ime algori thm for ap...

متن کامل

Subdifferential Conditions for Calmness of Convex Constraints

We study subdifferential conditions of the calmness property for multifunctions representing convex constraint systems in a Banach space. Extending earlier work in finite dimensions [R. Henrion and J. Outrata, J. Math. Anal. Appl., 258 (2001), pp. 110–130], we show that, in contrast to the stronger Aubin property of a multifunction (or metric regularity of its inverse), calmness can be ensured ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2013

ISSN: 0925-5001,1573-2916

DOI: 10.1007/s10898-013-0078-6